Remarks on 15-vertex (3, 3)-Ramsey graphs not containing K5
نویسنده
چکیده
The paper gives an account of previous and recent attempts to determine the order of a smallest graph not containing K5 and such that every 2-coloring of its edges results in a monochromatic triangle. A new 14-vertex K4-free graph with the same Ramsey property in the vertex coloring case is found. This yields a new construction of one of the only two known 15-vertex (3,3)-Ramsey graphs not containing K5.
منابع مشابه
Computing the Ramsey Number $R(K_5-P_3,K_5)$
We give a computer-assisted proof of the fact that R(K5 − P3,K5) = 25. This solves one of the three remaining open cases in Hendry’s table, which listed the Ramsey numbers for pairs of graphs on 5 vertices. We find that there exist no (K5−P3,K5)-good graphs containing a K4 on 23 or 24 vertices, where a graph F is (G, H)-good if F does not contain G and the complement of F does not containH. The...
متن کاملExponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs
We present a fixed parameter algorithm that constructively solves the k-dominating set problem on graphs excluding one of the K5 or K3,3 as a minor in time O(3 6 √ n). In fact, we present our algorithm for any H-minor-free graph where H is a single-crossing graph (can be drawn on the plane with at most one crossing) and obtain the algorithm for K3,3(K5)-minor-free graphs as a special case. As a...
متن کاملRamsey numbers for small graphs versus small disconnected graphs
The Ramsey number r(G,H) is determined for all disconnected (isolatefree) graphs H of order six and all graphs G of order at most five, except the three cases (G,H) ∈ {(K5 − 2K2, 2K3), (K5 − e, 2K3), (K5, 2K3)} where bounds with difference 1 are established. Moreover, general results are obtained for some small disconnected graphs H and any graph G.
متن کاملEmbedding Products of Graphs into Euclidean Spaces
For any collection of graphs G1, . . . , GN we find the minimal dimension d such that the product G1 × · · · ×GN is embeddable into R . In particular, we prove that (K5) and (K3,3) are not embeddable into R, where K5 and K3,3 are the Kuratowski graphs. This is a solution of a problem of Menger from 1929. The idea of the proof is the reduction to a problem from so-called Ramsey link theory: we s...
متن کاملAn Exact Formula for all Star-Kipas Ramsey Numbers
Let G1 and G2 be two given graphs. The Ramsey number R(G1,G2) is the least integer r such that for every graph G on r vertices, either G contains a G1 or G contains a G2. A complete bipartite graph K1,n is called a star. The kipas ̂ Kn is the graph obtained from a path of order n by adding a new vertex and joining it to all the vertices of the path. Alternatively, a kipas is a wheel with one edg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 16 شماره
صفحات -
تاریخ انتشار 1996